Boolean spectral theory

Dedicated Spectral Method of Boolean Function Decomposition

Spectral methods constitute a useful tool in the analysis and synthesis of Boolean functions, especially in cases when other methods reduce to brute-force search procedures. There is renewed interest in the application of spectral methods in this area, which extends also to the closely connected concept of the autocorrelation function, for which spectral methods provide fast calculation algorit...

Generalizing Boolean Satisfiability II: Theory

This is the second of three planned papers describing zap, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying zap is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to def...

A Boolean-valued probability theory

New foundations for probability theory are suggested and investigated, derived from the formalized systems theory and using also some other branches of mathematical logic. The probability measures are supposed to take their values not in the unit interval of reals, but in a special kind of Boolean algebras. Some analogies as well as differences of this approach with respect to the classical Kol...

Spectral Theory

Spectral theory has for its origin the classical theory of finite matrices and, in a sense, includes all theories which may be specialized to some particular phase of that classical theory. Such a meaning for the term spectral theory is perhaps too broad, for its acceptance would force one, as is becoming increasingly evident, to admit that spectral theory embraces not a small part of such fiel...

Spectral Theory